The Recursive Grid Layout Scheme for VLSI Layout of Hierarchical Networks

نویسندگان

  • Chi-Hsiang Yeh
  • Behrooz Parhami
  • Emmanouel A. Varvarigos
چکیده

We propose the recursive grid layout scheme for deriving efficient layouts of a variety of hierarchical networks and computing upper bounds on the VLSI area of general hierarchical networks. In particular, we construct optimal VLSI layouts for butterfly networks, generalized hypercubes, and star graphs that have areas within a factor of 1+ o(1) from their lower bounds. We also derive efficient layouts for a number of other important networks, such as cubeconnected cycles (CCC) and hypernets, which are the best results reported for these networks thus far.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient VLSI Layout of Grid Pyramid Networks

Reducing the VLSI layout area of on-chip networks can result in lower costs and better performance. Those layouts that are more compact can result in shorter wires and therefore the signal propagation through the wires will take place in less time. The grid-pyramid network is a generalized pyramid network based on a general 2D Grid structure (such as mesh, torus, hypermesh or WK-recursive mesh)...

متن کامل

Multilayer VLSI Layout for Interconnection Networks

Current VLSI technology allows more than two wiring layers and the number is expected to rise in future. In this paper, we show that, by designing VLSI layouts directly for an L-layer model, the layout area for a variety of networks can be reduced by a factor of about L 2 2 compared to the layout area required under a 2-layer model, and the volume and maximum wire length can be reduced by a fac...

متن کامل

VLSI Layout of Benes Networks

The Benes network consists of back-to-back butterflies. There exist a number of topological representations that are used to describe butterfly like architectures. We identify a new topological representation of Benes network. The significance of this representation is demonstrated by solving two problems, one related to VLSI layout and the other related to robotics. An important VLSI layout ne...

متن کامل

On the VLSI Area and Bisection Width of Star Graphs and Hierarchical Cubic Networks

We solve an open question posed by Akers and Krishnamurthy in 1986 [1, 3] concerning VLSI layout of star graphs. We show that the area of the optimal layout of an N-node star graph, hierarchical cubic network (HCN), or hierarchical folded-hypercube network (HFN) is N2=16 o(N2) under the Thompson model, or under the extended grid model where a node occupies a rectangle of sides that may range fr...

متن کامل

An Optimization Algorithm Based on Grid-graphs for Minimizing Interconnect Delay in Vlsi Layout Design

In this paper, we describe a routing optimization algorithm based on grid-graphs for application in a deep-submicron VLSI layout design. The proposed algorithm, named S-RABILA (for Simultaneous Routing and Buffer Insertion with Look-Ahead), constructs a maze routing path, simultaneously with buffer insertion and wire sizing, taking into account wire and buffer obstacles, such that the interconn...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999